A Note on the Three-portfolios Matching Problem

نویسندگان

  • FABIO TROJANI
  • PAOLO VANINI
  • LUIGI VIGNOLA
چکیده

A typical problem arising in the financial planning for private investors consists in the fact that the initial investor’s portfolio, the one determined by the consulting process of the financial institution and the universe of instruments made available to the investor have to be matched/optimized when determining the relevant portfolio choice. We call this problem the three-portfolios matching problem. Clearly, the resulting portfolio selection should be as close as possible to the optimal asset allocation determined by the consulting process of the financial institution. However, the transition from the investor’s initial portfolio to the final one is complicated by the presence of transaction costs and some further more specific constraints. Indeed, usually the portfolios under consideration are structured at different aggregation levels, making portfolios comparison and matching more difficult. Further, several investment restrictions have to be satisfied by the final portfolio choice. Finally, the arising portfolio selection process should be sufficiently transparent in order to incorporate the subjective investor’s trade-off between the objectives ’optimal portfolio matching’ and ’minimal portfolio transition costs’. In this paper, we solve the three-portfolios matching problem analytically for a simplified setting that illustrates the main features of the arising solutions and numerically for the more general situation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

Matching Portfolios by David Kane and Jeff Enos

“Matching” portfolios is a technique for generating a reasonable benchmark for determining the relative performance of a specific equity portfolio and is based on the work in Ho et al. (2005a). Consider the simplest case of a long-only mutual fund that has returned 10% in the last year. Has the portfolio done well? If the average stock in the universe has gone up 50% then, obviously, the portfo...

متن کامل

Three Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)

This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...

متن کامل

A Novel Assisted History Matching Workflow and its Application in a Full Field Reservoir Simulation Model

The significant increase in using reservoir simulation models poses significant challenges in the design and calibration of models. Moreover, conventional model calibration, history matching, is usually performed using a trial and error process of adjusting model parameters until a satisfactory match is obtained. In addition, history matching is an inverse problem, and hence it may have non-uni...

متن کامل

Color Matching of Blends Prepared From Black and White Fibers by Neural Networks (TECHNICAL NOTE)

The color of the blends of pre-colored fibers depends on the ratio of each fiber in the blends. Some theories have been introduced for color matching of blends of pre-colored fibers. Most however, are restricted in scope and accuracy. Kubelka and Munk presented the most applicable theory, which is still used in industry. In this work, the classical Kubelka-Munk method for color prediction of a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001